Walks , and Expander Graphs
نویسنده
چکیده
I have three goals for this lecture. The first is to introduce one of the most important familes of graphs: expander graphs. They are the source of much combinatorial power, and the counterexample to numerous conjectures. We will become acquainted with these graphs by examining random walks on them. To facilitate the analysis of random walks, we will examine these graphs through their adjacency matrices.
منابع مشابه
Random and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we study random walks on general regular graphs, leading to a the randomized logspace algo...
متن کاملRandom and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we will study random walks on general graphs, leading to a the randomized logspace algorit...
متن کاملDisjoint Paths in Expander Graphs via Random Walks: A Short Survey
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Frieze and Upfal.
متن کاملSymmetric Groups and Expander Graphs
We construct explicit generating sets Sn and S̃n of the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), Sn) and C(Sym(n), S̃n) into a family of bounded degree expanders for all n. This answers affirmatively an old question which has been asked many times in the literature. These expanders have many applications in the theory of random walks on groups, card shuffling a...
متن کاملLecture 6 : Random Walks versus Independent Sampling
For many problems it is necessary to draw samples from some distribution D on a typically large set V . In order to do so, one often considers a Markov chain on V whose limiting distribution is D. The efficiency of the sampling algorithm requires the Markov chain to converge quickly. Two famous examples where this approach have been applied successfully are approximation algorithms for the perm...
متن کامل